Weighted Competition Graphs
نویسنده
چکیده
We introduce a generalization of competition graphs, called weighted competition graphs. The weighted competition graph of a digraph D = (V,A), denoted by Cw(D), is an edge-weighted graph (G,w) such that G = (V,E) is the competition graph of D, and the weight w(e) of an edge e = xy ∈ E is the number of the common preys of x and y in D. We investigate properties of weighted competition graphs.
منابع مشابه
Population Dynamics on Complex Food Webs
In this work we analyze the topological and dynamical properties of a simple model of complex food webs, namely the niche model. We describe the system as an oriented weighted graph and we assign a Lotka-Volterra population dynamics on the structure created by the niche model. After this we introduce “predators” and “prey” weighted graphs from which we underline patterns of competition among sp...
متن کاملStructure Comparison of Binary and Weighted Niche-Overlap Graphs
In ecological networks, niche-overlap graphs are considered as complex systems. They represent the competition between two predators that share common resources. The purpose of this paper is to investigate the structural properties of these graphs considered as weighted networks and compare their measures with the ones calculated for the binary networks. To conduct this study, we select four cl...
متن کاملAUTOMORPHISM GROUPS OF SOME NON-TRANSITIVE GRAPHS
An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for ij, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce different weights for distinct nuclei. Balaban introduced some monster graphs and then Randic computed complexit...
متن کاملCompetitive Winner-Takes-All Clustering in the Domain of Graphs
We present a theoretical foundation for competitive learning in the domain of graphs within a connectionist framework. In the first part of this contribution we embed graphs in an Euclidean space to facilitate competitive learning in the domain of graphs. We adopt constitutive concepts of competitive learning like the scalar products, metrics, and the weighted mean for graphs. The first part is...
متن کاملGames on graphs
Evolution occurs in populations of reproducing individuals. The trajectories and outcomes of evolutionary processes depend on the structure of the population. Evolutionary graph theory is a powerful approach to studying the consequences of spatial or social population structure. The vertices of the graph represent individuals. The edges determine who interacts with whom for game payoff and who ...
متن کامل